An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain

This paper considers an approximate factorisation of three bivariate Bernstein basis polynomials that are defined in a triangular domain. problem is important for the computation intersection points curves computer-aided design systems, and it reduces to determination greatest common divisor (AGCD) d(y) polynomials. The Sylvester matrix its subresultant matrices these formed shown there four forms matrices. most difficult part degree because rank loss made harder by presence trinomial terms functions they cause entries span many orders magnitude. adverse numerical effects this wide range magnitudes mitigated processing before formed. It significantly improved results obtained if processed computations performed on their